Soundness, Completeness and Non-redundancy of Operational Semantics for Verilog Based on Denotational Semantics
نویسندگان
چکیده
This paper investigates three significant questions of Verilog’s operational semantics: soundness, completeness and non-redundancy. Our understanding for these three questions is denotational-based. We provide an operational semantics for Verilog and prove that our operational semantics is sound, complete and non-redundant.
منابع مشابه
Deriving Operational Semantics from Denotational Semantics for Verilog
This paper presents the derivation of an operational semantics from a denotational semantics for a subset of the widely used hardware description language Verilog. Our aim is to build equivalence between the operational and denotational semantics. We propose a discrete denotational semantic model for Verilog. A phase semantics is provided for each type of transition in order to derive the opera...
متن کاملFrom Operational Semantics to Denotational Semantics for Verilog
This paper presents the derivation of a denotational semantics from an operational semantics for a subset of the widely used hardware description language Verilog. Our aim is to build an equivalence between the operational and denotational semantics. We propose a discrete time semantic model for Verilog. Algebraic laws are also investigated in this paper, with the ultimate aim of providing a un...
متن کاملAn Operational Semantics for the Dataflow Algebra
This report defines an operational semantics for the event layer of the dataflow algebra, to complement the denotational semantics that has already been defined for it. The report defines a transition system and derivation sequences for this semantics, and then normal forms for these derivation sequences, which allow semantic functions to be defined directly for constructions in the algebra. Th...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملThe Semantics of Nominal Logic Programs
Nominal logic programming is a form of logic programming with “concrete” names and binding, based on nominal logic, a theory of alpha-equivalence founded on swapping and freshness constraints. Previous papers have employed different characterizations of the semantics of nominal logic programs, including operational, denotational, and prooftheoretic characterizations. In this paper we give a uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002